Generating Spatially Correlated Fields with a Genetic Algorithm

نویسندگان

  • YAKOV PACHEPSKY
  • DENNIS TIMLIN
چکیده

ÐGenerated realizations of random ®elds are used to quantify the natural variability of geological properties. When the realizations are used as inputs for simulations with a deterministic model, it may be desirable to minimize di€erences between statistics of sequential realizations and make the statistics close to ones speci®ed at generating the realizations. We describe the use of a genetic algorithm (GA) for this purpose. In unconditioned simulations, statistics of the GA-generated realizations were signi®cantly closer to the input ones than those from sequential Gaussian simulations. Distributions of generated values at a particular node over sequential realizations were close to the normal distribution. The GA is computationally intensive and may not be suitable for ®ne grids. The sequential Gaussian algorithm conditioned with GA-generated values on a coarse grid can produce a set of realizations with similar statistics for the ®ne grids embedding the coarse one. # 1998 Elsevier Science Ltd. All rights reserved Code available at http://www.iamg.org/CGEditor/index.htm

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a Joint Availability-Redundancy Optimization Model with Multi-State Components with Meta-Heuristic

This paper has been worked on a RAP with multi-state components and the performance rate of each component working state may increase by spending technical and organizational activities costs. Whereas RAP belongs to Np-Hard problems, we used Genetic algorithm (GA) and simulated annealing (SA) and for solving the presented problem and calculating system reliability universal generating function ...

متن کامل

Acoustic correlated sources direction finding in the presence of unknown spatial correlation noise

In this paper, a new method is proposed for DOA estimation of correlated acoustic signals, in the presence of unknown spatial correlation noise. By generating a matrix from the signal subspace with the Hankel-SVD method, the correlated resource information is extracted from each eigen-vector. Then a joint-diagonalization  structure is constructed of the signal subspace and basis it, independent...

متن کامل

An Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes

This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

متن کامل

A Multi Objective Genetic Algorithm (MOGA) for Optimizing Thermal and Electrical Distribution in Tumor Ablation by Irreversible Electroporation

Background: Irreversible electroporation (IRE) is a novel tumor ablation technique. IRE is associated with high electrical fields and is often reported in conjunction with thermal damage caused by Joule heating. For good response to surgery it is crucial to produce minimum thermal damage in both tumoral and healthy tissues named Non-Thermal Irreversible Electroporation(NTIRE). Non-thermal irrev...

متن کامل

A cultural algorithm for data ‎clustering‎

Clustering is a widespread data analysis and data mining technique in many fields of study such as engineering, medicine, biology and the like. The aim of clustering is to collect data points. In this paper, a Cultural Algorithm (CA) is presented to optimize partition with N objects into K clusters. The CA is one of the effective methods for searching into the problem space in order to find a n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998